public class Finding_Prime_Numbers {
    public static void main(String[] args) {
        int count = 0;
        for (int i = 101; i < 201; i++) {
            if (Is_Prime(i)) {
                System.out.println(i + "是素数");
                count++;
            }
        }
        System.out.println("一共有" + count + "个素数");
    }

    public static boolean Is_Prime(int n) {
        for (int i = 2; i < n; i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }
}
